/**
*      author: Y_Yao
*      created: 2024-12-20 10:48:12
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 6 + 7;
int n,S,T;
pair<int,int> p[N][2];
long double ans = LLINF;

long double dis(pair<int,int> p1,pair<int,int> p2)
{
    return sqrtl((p1.first - p2.first)*(p1.first - p2.first) + (p1.second
    - p2.second)*(p1.second - p2.second));
}

bool vis[N];

void dfs(int step,pair<int,int> now,long double t)
{
    if(step == n + 1)
    {
        ans = min(ans,t);
        return;
    }

    for(int i = 1;i <= n;i++)
    {
        if(vis[i]) continue;
        vis[i] = 1;
        for(int j = 0;j <= 1;j++)
        dfs(step + 1,p[i][!j],t+dis(now,p[i][j])/S+dis(p[i][j],p[i][!j])/T);
        vis[i] = 0;
    }
}

void solve()
{
    cin >> n >> S >> T;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 0;j <= 1;j++)
        {
            cin >> p[i][j].first >> p[i][j].second;
        }
    }

    dfs(1,make_pair(0,0),0.0);
    printf("%.20Lf",ans);
}

signed main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);

    int g = 1;
    //cin >> t;
    while(g--)
    {
        solve();
    }
    return 0;
}